%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : ITP033^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 03:38:26 EDT 2023

% Result   : Theorem 4.83s 5.01s
% Output   : Proof 4.83s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15  % Problem    : ITP033^1 : TPTP v8.1.2. Released v7.5.0.
% 0.13/0.16  % Command    : duper %s
% 0.15/0.38  % Computer : n007.cluster.edu
% 0.15/0.38  % Model    : x86_64 x86_64
% 0.15/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38  % Memory   : 8042.1875MB
% 0.15/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38  % CPULimit   : 300
% 0.15/0.38  % WCLimit    : 300
% 0.15/0.38  % DateTime   : Sun Aug 27 10:36:42 EDT 2023
% 0.15/0.38  % CPUTime    : 
% 4.83/5.01  SZS status Theorem for theBenchmark.p
% 4.83/5.01  SZS output start Proof for theBenchmark.p
% 4.83/5.01  Clause #1 (by assumption #[]): Eq (binary1721989714Tree_a h (binary717961607le_T_a t1 x t2)) True
% 4.83/5.01  Clause #3 (by assumption #[]): Eq
% 4.83/5.01    (∀ (H : a → int) (T1 : binary1439146945Tree_a) (X : a) (T2 : binary1439146945Tree_a),
% 4.83/5.01      binary1721989714Tree_a H (binary717961607le_T_a T1 X T2) → binary1721989714Tree_a H T1)
% 4.83/5.01    True
% 4.83/5.01  Clause #272 (by assumption #[]): Eq (Not (binary1721989714Tree_a h t1)) True
% 4.83/5.01  Clause #273 (by clausification #[272]): Eq (binary1721989714Tree_a h t1) False
% 4.83/5.01  Clause #340 (by clausification #[3]): ∀ (a_1 : a → int),
% 4.83/5.01    Eq
% 4.83/5.01      (∀ (T1 : binary1439146945Tree_a) (X : a) (T2 : binary1439146945Tree_a),
% 4.83/5.01        binary1721989714Tree_a a_1 (binary717961607le_T_a T1 X T2) → binary1721989714Tree_a a_1 T1)
% 4.83/5.01      True
% 4.83/5.01  Clause #341 (by clausification #[340]): ∀ (a_1 : a → int) (a_2 : binary1439146945Tree_a),
% 4.83/5.01    Eq
% 4.83/5.01      (∀ (X : a) (T2 : binary1439146945Tree_a),
% 4.83/5.01        binary1721989714Tree_a a_1 (binary717961607le_T_a a_2 X T2) → binary1721989714Tree_a a_1 a_2)
% 4.83/5.01      True
% 4.83/5.01  Clause #342 (by clausification #[341]): ∀ (a_1 : a → int) (a_2 : binary1439146945Tree_a) (a : a),
% 4.83/5.01    Eq
% 4.83/5.01      (∀ (T2 : binary1439146945Tree_a),
% 4.83/5.01        binary1721989714Tree_a a_1 (binary717961607le_T_a a_2 a T2) → binary1721989714Tree_a a_1 a_2)
% 4.83/5.01      True
% 4.83/5.01  Clause #343 (by clausification #[342]): ∀ (a_1 : a → int) (a_2 : binary1439146945Tree_a) (a : a) (a_3 : binary1439146945Tree_a),
% 4.83/5.01    Eq (binary1721989714Tree_a a_1 (binary717961607le_T_a a_2 a a_3) → binary1721989714Tree_a a_1 a_2) True
% 4.83/5.01  Clause #344 (by clausification #[343]): ∀ (a_1 : a → int) (a_2 : binary1439146945Tree_a) (a : a) (a_3 : binary1439146945Tree_a),
% 4.83/5.01    Or (Eq (binary1721989714Tree_a a_1 (binary717961607le_T_a a_2 a a_3)) False)
% 4.83/5.01      (Eq (binary1721989714Tree_a a_1 a_2) True)
% 4.83/5.01  Clause #345 (by superposition #[344, 1]): Or (Eq (binary1721989714Tree_a (fun x => h x) t1) True) (Eq False True)
% 4.83/5.01  Clause #1019 (by betaEtaReduce #[345]): Or (Eq (binary1721989714Tree_a h t1) True) (Eq False True)
% 4.83/5.01  Clause #1020 (by clausification #[1019]): Eq (binary1721989714Tree_a h t1) True
% 4.83/5.01  Clause #1021 (by superposition #[1020, 273]): Eq True False
% 4.83/5.01  Clause #1031 (by clausification #[1021]): False
% 4.83/5.01  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------